Evaluation Of A Parallel Chart Parser
نویسندگان
چکیده
We describe a parallel implementation of a chart parser for a shared-memory multipro-cessor. The speed-ups obtained with this parser have been measured for a number of small natural-language grammars. For the largest of these, part of an operational question-answering system, the parser ran 5 to 7 times faster than the serial version.
منابع مشابه
Parallel Implementation of an Active Chart Parser in Orca
Active Chart Parsing is an eecient strategy used to generate all possible parsings of a sentence given an ambiguous grammar. This document describes several serial and parallel implementations of an Active Chart Parser. Timing results show that for this ne grained parallel application no speedup can be achieved on a LAN of workstations.
متن کاملChart Parsing Head-Driven Phrase Structure Grammar
A Prolog chart parser for Head-Driven Phrase Structure Grammar (HPSG) is described. The HPSG formalism has undergone significant modification since Proudian and Pollard first introduced an HPSG chart parser in 1985. This paper describes the impact of these developments on chart parsing methodology. It also presents a critical evaluation of aspects of HPSG which emerges from our implementation.
متن کاملA Parallel Chart-based Parser for Analysing Ill-formed Inputs
This paper describes a parallel parsing method for analysing ill-formed inputs with consideration of full syntactic context. The method is developed to handle ill-formed inputs using tree searching scheme which is exible to utilize any kind of task distribution to gain parallelism. We choose dynamic task distribution as a core mechanism to control distributing tasks during the parsing process. ...
متن کاملAnalysing Ill-formed Inputs with Parallel Chart-based Techniques
In this paper, we describe a parallel implementation of chart-based parser which performs robustness to analyse grammatical ill-formed inputs in loosely-coupled environment. The parser is composed of parallel bottom-up process which parses the inputs under the grammar rules and parallel top-down process which tries to recover the existing ill-formedness when the bottom-up process fails to nd a ...
متن کاملAn FPGA-based syntactic parser for real-life unrestricted context-free grammars
This paper presents an FPGA-based implementation of a syntactic parser that can process languages generated by real-life unrestricted context-free grammars (CFGs). More precisely, we study the advantages ooered by a hardware implementation of a parallel version of a chart parsing algorithm adapted for word lattice parsing with unrestricted CFGs. Natural Language Processing applications, for whi...
متن کامل